Chemical Graphs, Chemical Reaction Graphs, and Chemical Graph Transformation
نویسندگان
چکیده
Chemical reactions are described by edge relabeling graph transformation rules, in which a substrate chemical graph is transformed into a product chemical graph by breaking existing bonds and creating new bonds between atoms. These edge relabeling graph transformation rules are themselves chemical graphs, where the order of a bond before the chemical reaction is distinguished from the order of the bond after the chemical reaction. The approach is illustrated by an implementation on top of the PerlMol collection of Perl modules for computational chemistry.
منابع مشابه
Applications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملThe Center and Periphery of Composite Graphs
The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nan...
متن کاملComputer Generation of Characteristic Polynomials of Edge-Weighted Graphs, Heterographs, and Directed Graphs
The computer code developed previously (K. Balasubramanian, J . Computational Chern., 5,387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and signed graphs. This extension leads to a number of important applications of this code to several ...
متن کاملNetworks Induced in Nonlinear Chemical Reaction System by Symmetries of Transformation Groups
Physical systems possess a structure and display dynamics. The article describes how a structure of one class of systems, which are encountered in chemical kinetics, can be revealed. The structure may be represented by a graph that has some similarities with the graph used to display the structure of chemical molecules. The graphs are induced by one-parameter transformation groups in nonlinear ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 127 شماره
صفحات -
تاریخ انتشار 2005